منابع مشابه
Ising models and multiresolution quad - trees by
We study percolation and Ising models defined on generalizations of quad-trees used in multiresolution image analysis. These can be viewed as trees for which each mother vertex has 2 daughter vertices, and for which daughter vertices are linked together in d-dimensional Euclidean configurations. Retention probabilities / interaction strengths differ according to whether the relevant bond is bet...
متن کاملCompressed Random-Access Trees
We design a compact adaptive tree structure for random access to coherent spatial data. Many papers explore compressed trees, but nearly all involve entropy coding of a sequential traversal, thus precluding random queries required by rendering algorithms. Instead, we use fixed-rate encoding for both the tree topology and its data. Key elements include the replacement of pointers by local offset...
متن کاملTexture Minification using Quad-trees and Fipmaps
The paper extends the recently published methods for image reconstruction and texture minification using the generalized ripmap method, named fipmap, and quad-trees. Fipmap is based on the technique of partitioned iterated function systems, used in fractal image compression. The quad-tree texture reconstruction algorithm works well for many standard cases. The special cases can be solved using ...
متن کاملPractical Compressed Suffix Trees
The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representation...
متن کاملEngineering Fully-Compressed Suffix Trees
The suffix tree is a classical data structure that provides optimal solutions to countless string processing problems. For a text of length n, a pointerbased representation of a suffix tree requires Θ(n log n) bits, whereas compact representations use O(n) bits on top of the size of the compressed text. The fully-compressed suffix tree (FCST) provides the same functionality using o(n) bits on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1984
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/27.3.225